Setting of moving object location with optimized tree structure

نویسندگان

  • OGNIAN NAKOV
  • DESSISLAVA PETROVA
چکیده

Object tracking is an important part of the common problem for the autonomous motion planning. The main theme of this paper is to propose a data aggregation model for object tracking. Object tracking typically involves two basic operations: update and query. In general, updates of an object’s location are initiated when object moves from one point to another. A query in invoked each time when there is need to find the location of the interested object. Location updates and queries may be done in various ways. We propose a new tree structure for in-network object tracking. The location update part of our solution can be viewed as an extension of [2]. In particular, we take the physical topology of the network into consideration. We will reduce the update cost. Several principles, namely, deviation-avoidance and highest-weight-first ones are pointed out to construct an object tracking tree to reduce the communication cost of location update. Our proposed solution tries to divide the network area into squire-like zones, and recursively combine these zones into a tree.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Location Index for the Semantic Search of Moving Objects

In moving object databases, researches on the spatio-temporal access method are very important for the efficient search of moving object location in ITS, LBS, and Telematics. Recently, researches are being made actively on the efficient management of the current location of moving objects and on the estimation of future location using information such as the current location and moving pattern ...

متن کامل

Efficient Enforcement of Security Policies Based on Tracking of Mobile Users

Recent advances to mobile communication, Global Positioning System (GPS) and Radio Frequency Identification (RFID) technologies have propelled the growth of a number of mobile services. These require maintaining mobile object’s location information and efficiently serving access requests on the past, present and future status of the moving objects. Moreover, these services raise a number of sec...

متن کامل

Framework for Snapshot Location-based Query Processing on Moving Objects in Road Networks∗

Location-based services are increasingly popular recently and efficiently supporting queries is a key challenge. Here, we present a novel design to process large numbers of location-based snapshot queries on MOVing objects in road Networks (MOVNet, for short). MOVNet’s dual-index design utilizes an on-disk R-tree to store the network connectivities and an in-memory grid structure to maintain mo...

متن کامل

SeTPR*-tree: Efficient Buffering for Spatiotemporal Indexes Via Shared Execution

In this paper, we study the problem of efficient spatiotemporal indexing of moving objects. In order to reduce the frequency of object location updates, a linear motion model is used to model the near future location of moving objects. A number of existing spatiotemporal indexes have already been proposed for indexing these models. However, these indexes are either designed to offer high query ...

متن کامل

An Efficient Algorithm for Mining Spatially Co-located Moving Objects

Mining co-location patterns from spatial databases may disclose the types of spatial features which are likely located as neighbors’ in space. Accordingly, we present an algorithm previously for mining spatially co-located moving objects using spatial data mining techniques and Prim’s Algorithm. In the previous technique, the scanning of database to mine the spatial co-location patterns took mu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007